Estimating the Major Cluster by Mean-Shift with Updating Kernel
نویسندگان
چکیده
منابع مشابه
1 Covariate Shift by Kernel Mean Matching
Given sets of observations of training and test data, we consider the problem of re-weighting the training data such that its distribution more closely matches that of the test data. We achieve this goal by matching covariate distributions between training and test sets in a high dimensional feature space (specifically, a reproducing kernel Hilbert space). This approach does not require distrib...
متن کاملImage and Video Segmentation by Anisotropic Kernel Mean Shift
Mean shift is a nonparametric estimator of density which has been applied to image and video segmentation. Traditional mean shift based segmentation uses a radially symmetric kernel to estimate local density, which is not optimal in view of the often structured nature of image and more particularly video data. In this paper we present an anisotropic kernel mean shift in which the shape, scale, ...
متن کاملStructured Combination of Particle Filter and Kernel Mean Shift Tracking
Particle filters are a powerful and widely used visual tracking technology. Their strength lies in their ability to represent multi-modal probability distributions that capture and maintain multiple hypotheses about target properties. A potential weakness, however, is that the particle set can become diffused, dispersing across the image plane rather than clustering around the target. A number ...
متن کاملAnalysis of Kernel Mean Matching under Covariate Shift
In real supervised learning scenarios, it is not uncommon that the training and test sample follow different probability distributions, thus rendering the necessity to correct the sampling bias. Focusing on a particular covariate shift problem, we derive high probability confidence bounds for the kernel mean matching (KMM) estimator, whose convergence rate turns out to depend on some regularity...
متن کاملKernel Bandwidth Adaptive Target Tracking Algorithm Based on Mean - Shift
The kernel bandwidth of the classical Mean-Shift tracking algorithm is fixed, and it usually results in tracking failure when the target’s size changes. A kernel bandwidth adaptive Mean-Shift tracking algorithm is presented with frame difference method to solve the question in this paper. According to the targets’ size obtained from the inter-frame difference method, the bandwidth matrix of ker...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7090771